Binomial vanishing ideals
نویسندگان
چکیده
In this note we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K. 2010 MSC: 13F20, 13C05, 14H45
منابع مشابه
Binomial Ideals David Eisenbud and Bernd Sturmfels
Introduction. It is notoriously difficult to deduce anything about the structure of an ideal or scheme by directly examining its defining polynomials. A notable exception is that of monomial ideals. Combined with techniques for making fiat degenerations of arbitrary ideals into monomial ideals (typically, using Gr6bner bases), the theory of monomial ideals becomes a useful tool for studying gen...
متن کاملLog Canonical Thresholds of Binomial Ideals
We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming.
متن کاملBinomial Difference Ideals
In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Gröbner basis of Z[x]-lattices, regular and coherent difference ascending chains, and partial characters over Z[x]-lattices, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, and perfect a...
متن کاملCellular Binomial Ideals. Primary Decomposition of Binomial Ideals
It is known that algorithms exist which compute primary decompositions of polynomial ideals (Gianni et al., 1988; Eisenbud et al., 1992; Becker and Weispfenning, 1993; and more recently Shimoyama and Yokoyama, 1996). However, in case the ideal is binomial, binomiality of its primary components is not assured, that is, the above algorithms do not necessarily compute a decomposition into binomial...
متن کاملOn the binomial edge ideals of block graphs
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.
متن کامل